Regular Intersecting Families
نویسندگان
چکیده
We call a family of sets intersecting, if any two sets in the family intersect. In this paper we investigate intersecting families F of k-element subsets of [n] := {1, . . . , n}, such that every element of [n] lies in the same (or approximately the same) number of members of F . In particular, we show that we can guarantee |F| = o( ( n−1 k−1 ) ) if and only if k = o(n).
منابع مشابه
Regular bipartite graphs and intersecting families
In this paper we present a simple unifying approach to prove several statements about intersecting and cross-intersecting families, including the Erdős–Ko–Rado theorem, the Hilton–Milner theorem, a theorem due to Frankl concerning the size of intersecting families with bounded maximal degree, and versions of results on the sum of sizes of non-empty cross-intersecting families due to Frankl and ...
متن کاملIntersecting Families of Finite Sets and Fixed-point-Free 2-Elements
We study the maximum cardinality of a pairwise-intersecting family of subsets of an n-set, or the size of the smallest set in such a family, under either of the assumptions that it is regular (as a hypergraph) or that it admits a transitive permutation group. Not surprisingly, results under the second assumption are stronger. We also give some results for 4-wise intersecting families under the ...
متن کاملAn Arithmetic Analogue of Bezout’s Theorem
In this paper, we prove two versions of an arithmetic analogue of Bezout’s theorem, subject to some technical restrictions. The basic formula proven is deg(V )h(X∩Y ) = h(X) deg(Y )+h(Y ) deg(X)+O(1), where X and Y are algebraic cycles varying in properly intersecting families on a regular subvariety VS ⊂ PS . The theorem is inspired by the arithmetic Bezout inequality of Bost, Gillet, and Soul...
متن کاملIntersecting designs from linear programming and graphs of diameter two
We investigate l-designs (regular intersecting families) and graphs of diameter 2. The optimal configurations are either projective planes or design-like structures closely related to finite geometries. The new results presented here are corollaries of a recent improvement about uniform hypergraphs with maximal fractional matchings. We propose several open problems.
متن کاملMost Probably Intersecting Hypergraphs
The celebrated Erdős-Ko-Rado theorem shows that for n > 2k the largest intersecting k-uniform set family on [n] has size ( n−1 k−1 ) . It is natural to ask how far from intersecting larger set families must be. Katona, Katona and Katona introduced the notion of most probably intersecting families, which maximise the probability of random subfamilies being intersecting. We consider the most prob...
متن کامل